Binary functions, degeneracy, and alternating dimaps
نویسندگان
چکیده
منابع مشابه
Schur Functions and Alternating Sums
Abstract We discuss several well known results about Schur functions that can be proved using cancellations in alternating summations; notably we shall discuss the Pieri and Murnaghan-Nakayama rules, the JacobiTrudi identity and its dual (Von Nägelsbach-Kostka) identity, their proofs using the correspondence with lattice paths of Gessel and Viennot, and finally the Littlewood-Richardson rule. O...
متن کاملAlternating permutations and symmetric functions
Abstract We use the theory of symmetric functions to enumerate various classes of alternating permutations w of {1, 2, . . . , n}. These classes include the following: (1) both w and w−1 are alternating, (2) w has certain special shapes, such as (m − 1,m − 2, . . . , 1), under the RSK algorithm, (3) w has a specified cycle type, and (4) w has a specified number of fixed points. We also enumerat...
متن کاملImproved dynamic regret for non-degeneracy functions
Recently, there has been a growing research interest in the analysis of dynamic regret, which measures the performance of an online learner against a sequence of local minimizers. By exploiting the strong convexity, previous studies have shown that the dynamic regret can be upper bounded by the path-length of the comparator sequence. In this paper, we illustrate that the dynamic regret can be f...
متن کاملCounting Binary Words Avoiding Alternating Patterns
Let F [p] denote the set of binary words, with no more 0’s than 1’s, that do not contain the pattern p = (10)1 as a factor for any fixed j ≥ 1. We give the generating function for the integer sequence enumerating, according to the number of 1’s, the words in F [p].
متن کاملGeneration of binary words avoiding alternating patterns
In this paper we propose an algorithm to generate binary words with no more 0’s than 1’s having a fixed number of 1’s and avoiding the pattern (10)1 for any fixed j ≥ 1. We will prove that this generation is exhaustive, that is, all such binary words are generated.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2019
ISSN: 0012-365X
DOI: 10.1016/j.disc.2019.01.029